Computational hardness assumptions - PDFSEARCH.IO - Document Search Engine

Computational hardness assumptions
Results: 76

#	Item
41	Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields Jean-Charles Faug`ere1 Ludovic Perret1 Gu´ena¨el Renault1 Add to Reading List Source URL: www.iacr.org Language: English - Date: 2012-04-20 07:14:48 Group theory Cryptography Logarithms Computational hardness assumptions Index calculus algorithm Discrete logarithm Elliptic curve XTR Polynomial Abstract algebra Algebra Finite fields
42	A Signature Scheme as Secure as the Diffie-Hellman Problem Eu-Jin Goh and StanisÃlaw Jarecki Computer Science Department, Stanford University, Stanford CA[removed]removed], [removed] Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:52 Computational hardness assumptions BLS Schnorr signature Forking lemma Digital signature XTR ElGamal encryption Random oracle Diffie–Hellman problem Cryptography Public-key cryptography Finite fields
43	Cover and Decomposition Index Calculus on Elliptic Curves made practical Application to a previously unreachable curve over Fp6 Vanessa VITSE – Antoine JOUX Universit´ Add to Reading List Source URL: www.iacr.org Language: English - Date: 2012-04-20 07:04:20 Finite fields Cryptography Logarithms Computational hardness assumptions Index calculus algorithm Elliptic curve cryptography Elliptic curve Discrete logarithm Calculus Abstract algebra Mathematics Group theory
44	ANOTHER LOOK AT NON-STANDARD DISCRETE LOG AND DIFFIE-HELLMAN PROBLEMS NEAL KOBLITZ AND ALFRED MENEZES Abstract. We examine several versions of the one-more-discrete-log and one-more-Diffie-Hellman problems. In attempting Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-09-21 19:02:16 Finite fields Computational hardness assumptions Cryptographic protocols Group theory Diffie–Hellman problem XTR Index calculus algorithm Diffie–Hellman key exchange Random oracle Cryptography Abstract algebra Mathematics
45	A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and its Applications Emmanuel Bresson1 , Dario Catalano2 , and David Pointcheval2 1 Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:54 Finite fields Electronic commerce Paillier cryptosystem Okamoto–Uchiyama cryptosystem Goldwasser–Micali cryptosystem XTR ElGamal encryption Diffie–Hellman problem RSA Cryptography Public-key cryptography Computational hardness assumptions
46	Boneh et al.’s k-Element Aggregate Extraction Assumption Is Equivalent to The Diffie-Hellman Assumption Jean-Sebastien Coron and David Naccache Gemplus Card International 34, rue Guynemer, Issy-les-Moulineaux, F-92447, Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:54 Public-key cryptography Computational hardness assumptions BLS Diffie–Hellman problem Digital signature XTR Parity of a permutation Diffie–Hellman key exchange Structure Cryptography Finite fields Cryptographic protocols
47	Non-Interactive Key Exchange and Key Assignment Schemes Eduarda Sim˜oes Veloso Freire Thesis submitted to the University of London for the degree of Doctor of Philosophy Add to Reading List Source URL: www.isg.rhul.ac.uk Language: English - Date: 2014-02-04 17:42:47 Cryptographic protocols Computational hardness assumptions Whitfield Diffie Diffie–Hellman key exchange Diffie–Hellman problem Digital signature Random oracle Standard model Hellman Cryptography Public-key cryptography Key management
48	Advances in Cryptology – Proceedings of Crypto ’07 (August 19–[removed], Santa Barbara, CA) A. Menezes Ed. Springer-Verlag, LNCS 4622, pages 482–499. A generalization of DDH with applications to protocol analysis a Add to Reading List Source URL: www.ssi.gouv.fr Language: English - Date: 2012-11-06 05:29:19 Decisional Diffie–Hellman assumption Mathematics Diffie–Hellman problem XTR Diffie–Hellman key exchange Computational Diffie–Hellman assumption Computational hardness assumptions Finite fields Cryptographic protocols
49	The Past, evolving Present and Future of Discrete Logarithm Antoine Joux, Andrew Odlyzko and Cécile Pierrot Abstract The first practical public key cryptosystem ever published, the Diffie-Hellman key exchange algorithm, Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 2014-06-04 21:00:21 Finite fields Logarithms Computational hardness assumptions Group theory Diffie–Hellman problem Index calculus algorithm Discrete logarithm XTR Elliptic curve cryptography Abstract algebra Cryptography Mathematics
50	PDF Document Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 2012-07-03 09:59:40 Finite fields Group theory Logarithms Computational hardness assumptions Cryptography Index calculus algorithm Discrete logarithm Hyperelliptic curve cryptography XTR Abstract algebra Mathematics Algebra